Polyhedral analysis and decompositions for capacitated plant location-type problems
نویسندگان
چکیده
منابع مشابه
Polyhedral Analysis and Decompositions for Capacitated Plant Location-type Problems
We study the polyhedral structure of two primal relaxations of a class of specially structured mixed integer programming problems. This class includes the generalized capacitated plant location problem and a production scheduling problem as special cases. We show that for this class of problems two polyhedra constructed from the constraint sets in two difl‘erent primal relaxations are identical...
متن کاملUncapacitated and Capacitated Facility Location Problems
The uncapacitated facility location problem ( UFLP) involves locating an undetermined number of facilities to minimize the sum of the (annualized) fixed setup costs and the variable costs of serving the market demand from these facilities. UFLP is also known as the “simple” facility location problem SFLP, where both the alternative facility locations and the customer zones are considered discre...
متن کاملCapacitated facility location/network design problems
We introduce a combined facility location/network design problem in which facilities have constraining capacities on the amount of demand they can serve. This model has a number of applications in regional planning, distribution, telecommunications, energy management, and other areas. Our model includes the classical capacitated facility location problem (CFLP) on a network as a special case. W...
متن کاملHeuristic Methods Based on MINLP Formulation for Reliable Capacitated Facility Location Problems
This paper addresses a reliable facility location problem with considering facility capacity constraints. In reliable facility location problem some facilities may become unavailable from time to time. If a facility fails, its clients should refer to other facilities by paying the cost of retransfer to these facilities. Hence, the fail of facilities leads to disruptions in facility location dec...
متن کاملImproved Approximation Algorithms for Capacitated Facility Location Problems
In a surprising result, Korupolu, Plaxton, and Rajaraman [13] showed that a simple local search heuristic for the capacitated facility location problem (CFLP) in which the service costs obey the triangle inequality produces a solution in polynomial time which is within a factor of 8+ ǫ of the value of an optimal solution. By simplifying their analysis, we are able to show that the same heuristi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 1998
ISSN: 0166-218X
DOI: 10.1016/s0166-218x(97)00096-6